A Unified Approach to Active Dual Supervision for Labeling Features and Examples.

Optimizing debt collections using constrained reinforcement learning.

Uncertainty sampling and transductive experimental design for active dual supervision.
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text classification where it is frequently possible to provide domain knowledge in the form of words that associate strongly with a class. In this paper, we consider the novel problem of active dual supervision, or, how to optimally query an example and feature labeling oracle to simultaneously collect two different forms of supervision, with the objective of building the best classifier in the most cost effective manner. We apply classical uncertainty and experimental design based active learning schemes to graph/kernel-based dual supervision models. Empirical studies confirm the potential of these schemes to significantly reduce the cost of acquiring labeled data for training high-quality models. 1.
Sentiment analysis of blogs by combining lexical knowledge with text classification.

Active Feature%2DValue Acquisition.
Most induction algorithms for building predictive models take as input training data in the form of feature vectors. Acquiring the values of features may be costly, and simply acquiring all values may be wasteful, or prohibitively expensive. Active feature-value acquisition (AFA) selects features incrementally in an attempt to improve the predictive model most cost-effectively. This paper presents a framework for AFA based on estimating information value. While straightforward in principle, estimations and approximations must be made to apply the framework in practice. We present an acquisition policy, Sampled Expected Utility (SEU), that employs particular estimations to enable effective ranking of potential acquisitions in settings where relatively little information is available about the underlying domain. We then present experimental results showing that, as compared to the policy of using representative sampling for feature acquisition, SEU reduces the cost of producing a model of a desired accuracy and exhibits consistent performance across domains. We also extend the framework to a more general modeling setting in which feature values as well as class labels are missing and are costly to acquire. 


Using predictive analysis to improve invoice%2Dto%2Dcash collection.

Customer targeting models using actively%2Dselected web content.
We consider the problem of predicting the likelihood that a company will purchase a new product from a seller. The statistical models we have developed at IBM for this purpose rely on historical transaction data coupled with structured firmographic information like the company revenue, number of employees and so on. In this paper, we extend this methodology to include additional text-based features based on analysis of the content on each company’s website. Empirical results demonstrate that incorporating such web content can significantly improve customer targeting. Furthermore, we present methods to actively select only the web content that is likely to improve our models, while reducing the costs of acquisition and processing.

Breast cancer identification KDD CUP winner%27s report.


Active Learning for Probability Estimation Using Jensen%2DShannon Divergence.
Abstract. Active selection of good training examples is an important approach to reducing data-collection costs in machine learning; however, most existing methods focus on maximizing classification accuracy. In many applications, such as those with unequal misclassification costs, producing good class probability estimates (CPEs) is more important than optimizing classification accuracy. We introduce novel approaches to active learning based on the algorithms Bootstrap-LV and ACTIVEDECORATE, by using Jensen-Shannon divergence (a similarity measure for probability distributions) to improve sample selection for optimizing CPEs. Comprehensive experimental results demonstrate the benefits of our approaches. 1
Combining Bias and Variance Reduction Techniques for Regression Trees.
Abstract. Gradient Boosting and bagging applied to regressors can reduce the error due to bias and variance respectively. Alternatively, Stochastic Gradient Boosting (SGB) and Iterated Bagging (IB) attempt to simultaneously reduce the contribution of both bias and variance to error. We provide an extensive empirical analysis of these methods, along with two alternate bias-variance reduction approaches — bagging Gradient Boosting (BagGB) and bagging Stochastic Gradient Boosting (BagSGB). Experimental results demonstrate that SGB does not perform as well as IB or the alternate approaches. Furthermore, results show that, while BagGB and BagSGB perform competitively for low-bias learners, in general, Iterated Bagging is the most effective of these methods. 1
An Expected Utility Approach to Active Feature%2DValue Acquisition.


Creating diversity in ensembles using artificial data.
The diversity of an ensemble of classifiers is known to be an important factor in determining its generalization error. We present a new method for generating ensembles,  Decorate (Diverse Ensemble Creation by Oppositional Relabeling of Artificial Training Examples), that directly constructs diverse hypotheses using additional artificially-constructed training examples. The technique is a simple, general meta-learner that can use any strong learner as a base classifier to build diverse committees. Experimental results using decision-tree induction as a base learner demonstrate that this approach consistently achieves higher predictive accuracy than the base classifier, Bagging and Random Forests. Decorate also obtains higher accuracy than Boosting on small training sets, and achieves comparable performance on larger training sets.

Diverse ensembles for active learning.
Query by Committee is an eective approach  to selective sampling in which disagreement  amongst an ensemble of hypotheses is used  to select data for labeling. Query by Bagging  and Query by Boosting are two practical  implementations of this approach that  use Bagging and Boosting, respectively, to  build the committees. For eective active  learning, it is critical that the committee be  made up of consistent hypotheses that are  very dierent from each other. Decorate  is a recently developed method that directly  constructs such diverse committees using arti  cial training data. This paper introduces  Active-Decorate, which uses Decorate  committees to select good training examples.
Experiments on Ensembles with Missing and Noisy Data.
One of the potential advantages of multiple classifier systems  is an increased robustness to noise and other imperfections in data.
Constructing Diverse Classifier Ensembles using Artificial Training Examples.
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the members of an ensemble is known to be an important factor in determining its generalization error. This paper presents a new method for generating ensembles that directly constructs diverse hypotheses using additional artificially-constructed training examples. The technique is a simple, general meta-learner that can use any strong learner as a base classifier to build diverse committees. Experimental results using decision-tree induction as a base learner demonstrate that this approach consistently achieves higher predictive accuracy than both the base classifier and bagging, and also obtains higher accuracy than boosting early in the learning curve when training data is limited.
Content%2DBoosted Collaborative Filtering for Improved Recommendations.
Most recommender systems use Collaborative Filtering or Content-based methods to predict new items of interest for a user. While both methods have their own advantages, individually they fail to provide good recommendations in many situations. Incorporating components from both methods, a hybrid recommender system can overcome these shortcomings.
Natural Language Assistant A Dialog System for Online Product Recommendation
With the emergence of e-commerce systems, successful information access on e-commerce websites becomes essential. Menu-driven navigation and keyword search currently provided by most commercial sites have considerable limitations, as they tend to overwhelm and frustrate users with lengthy, rigid and not very effective interactions. To provide an efficient solution for information access, we have built the Natural Language Assistant (NLA), a web-based natural language dialog system to help users find relevant products on e-commerce sites. The system brings together technologies in natural language processing and human computer interaction to create a faster and more intuitive way of interacting with web sites. By combining statistical parsing techniques with traditional AI rule-based technology, we have created a dialog system that accommodates both customer needs and business requirements. The system is currently embedded in an application for recommending laptops and was deployed as a pilot on IBM’s website.
